Defeasible Laws, Parallel Actions, and Reasoning about Resources

نویسندگان

  • Sandeep Chintabathina
  • Michael Gelfond
  • Richard Watson
چکیده

We introduce a new action language, CARD, which allows defeasible dynamic causal laws, default fluents, concurrent and non-deterministic actions, and actions which use resources. We give syntax and semantics of the language and several simple examples of its use. Comparison with some other languages is also given though limited by space requirements.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Laws Are Persistent Inductive Schemes

The characteristic difference between laws and accidental generalizations lies in our epistemic or inductive attitude towards them. This idea has taken various forms and dominated the discussion about lawlikeness in the last decades. Hence, ranking theory with its resources of formalizing defeasible reasoning or inductive schemes seems ideally suited to explicate the idea in a formal way. This ...

متن کامل

Defeasible Reasoning and Partial Order Planning

Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This problem affects every aspect of a planning process. We will present an argumentation-based formalism that an agent could use for constructing plans starting from a previously introduced formalism. In such a formalism, agents repre...

متن کامل

Representing Defeasible Constraints and Observations in Action Theories

We propose a general formulation of reasoning about action based on prioritized logic programming, where defeasibility handling is explicitly taken into account. In particular, we consider two types of de-feasibilities in our problem domains: defeasible constraints and defeasible observations. By introducing the notion of priority in action formulation, we show that our approach provides a unii...

متن کامل

Programming Cognitive Agents in Defeasible Logic

Defeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences and actions, together with inference procedures. We discuss patterns of agent types in this setting. Finally, we illustrate the language by an example of an agent reasoning about web-services.

متن کامل

Handling Defeasibilities in Reasoning about Action: a Prioritized Logic Programming Approach Running Title: Handling Defeasibilities

Representing defeasibility is an important issue in commonsense reasoning. In reasoning about action and change, this issue becomes more di cult because domain and action related defeasible information may con ict with general inertia rules. Furthermore, di erent types of defeasible information may also interfere with each other during the reasoning. In this paper, we develop a prioritized logi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007